stack symbol造句

The parser's next action is determined by the rightmost stack symbol ( s ) and the lookahead symbol.
The parser tables show what to do next, for every legal combination of topmost parse stack symbols and lookahead symbol.
A deterministic pushdown automaton has at most one legal transition for the same combination of input symbol, state, and top stack symbol.
In LR parsers, the shift and reduce decisions are potentially based on the entire stack of everything that has been previously parsed, not just on a single, topmost stack symbol.
Because occasionally a rewrite rule might need to be conditioned on the stack being in some sense " empty ", the symbol " # " is used as the bottom-most stack symbol, meaning an " empty " stack contains exactly one symbol, " # ".
It's difficult to find stack symbol in a sentence. 用stack symbol造句挺难的